On the Expressiveness of TPTL and MTL
نویسندگان
چکیده
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [4] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
منابع مشابه
On the Expressiveness of TPTL and MTL over ω-Data Words
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé...
متن کاملP . Bouyer , F . Chevalier and N . Markey About the Expressiveness of TPTL and MTL Research Report LSV - 05 - 05 May 2005
TPTL and MTL are two classical timed extensions of LTL. In this paper, we answer a 15 year old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [AH90] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
متن کاملOn the Expressiveness of TPTL and MTL over \omega-Data Words
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé...
متن کاملThe expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words
Recently, verification and analysis of data words have gained a lot of interest. Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are two extensions of Linear time temporal logic (LTL). In MTL, the temporal operator are indexed by a constraint interval. TPTL is a more powerful logic that is equipped with a freeze formalism. It uses register variables, which can be set t...
متن کاملOn Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing
Timed temporal logics exhibit a bewildering diversity of operators and the resulting decidability and expressiveness properties also vary considerably. We study the expressive powers of timed logics TPTL[U,S] and MTL[UI ,SI ] as well as their several fragments. Extending the LTL EF games of Etessami and Wilke, we define MT L Ehrenfeucht-Fraisse games on a pair of timed words. Using the associat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 208 شماره
صفحات -
تاریخ انتشار 2005